Linear Higher-Order Pre-Unification
نویسندگان
چکیده
We develop an efficient representation and a pre-unification algorithm in the style of Huet for the This extended abstract has been submitted to the Twelfth Annual Symposium on Logic in Computer Science LICS’97, Warsaw, Poland, June 29th – July 2nd 1997. linear λ-calculus λ→−◦&> which includes intuitionistic functions (→), linear functions (−◦), additive pairing (&), and additive unit (>). Applications lie in proof search, logic programming, and logical frameworks based on linear type theories. We also show that, surprisingly, a similar pre-unification algorithm does not exist for certain sublanguages. ∗ This work was supported by NSF Grant CCR-9303383. The second author was supported by the Alexander-vonHumboldt-Stiftung when working on this paper, during a visit to the Department of Mathematics of the Technical University Darmstadt.
منابع مشابه
Bounded Higher-order Unification using Regular Terms
We present a procedure for the bounded unification of higher-order terms [24]. The procedure extends G. P. Huet’s pre-unification procedure [11] with rules for the generation and folding of regular terms. The concise form of the procedure allows the reuse of the pre-unification correctness proof. Furthermore, the regular terms can be restricted in order to get a decidable unifiability problem. ...
متن کاملPattern Unification for the Lambda Calculus with Linear and Affine Types
Logic programming languages, type inference algorithms, and automated theorem provers are all examples of systems that rely on unification. If the unification problem has to deal with logic variables at higher type (functional type), we speak of higher-order unification [4]. Higher-order unification is in general undecidable, but it can be turned decidable, if appropriately restricted to a frag...
متن کاملHigher-Order Unification Revisited: Complete Sets of Transformations
In this paper, we reexamine the problem of general higher-order unification and develop an approach based on the method of transformations on systems of terms which has its roots in Herbrand’s thesis, and which was developed by Martelli and Montanari in the context of first-order unification. This method provides an abstract and mathematically elegant means of analyzing the invariant properties...
متن کامل